Periodicity on partial words
نویسندگان
چکیده
منابع مشابه
On Periodicity Lemma for Partial Words
We investigate the function L(h, p, q), called here the threshold function, related to periodicity of partial words (words with holes). The value L(h, p, q) is defined as the minimum length threshold which guarantees that a natural extension of the periodicity lemma is valid for partial words with h holes and (strong) periods p, q. We show how to evaluate the threshold function in O(log p + log...
متن کاملPeriodicity Algorithms for Partial Words
In this paper we investigate several periodicity-related algorithms for partial words. First, we show that all periods of a partial word of length n are determined in O(n logn), and provide algorithms and data structures that help us answer in constant time queries regarding the periodicity of their factors. For this we need a O(n2) preprocessing time and a O(n) updating time, whenever the word...
متن کاملPeriodicity algorithms and a conjecture on overlaps in partial words
We propose an algorithm that given as input a full word w of length n, and positive integers p and d, outputs, if any exists, a maximal pperiodic partial word contained in w with the property that no two holes are within distance d (so-called d-valid). Our algorithm runs in O(nd) time and is used for the study of repetition-freeness of partial words. Furthermore, we construct an infinite word o...
متن کاملFine and Wilf’s Periodicity on Partial Words and Consequences
The concept of periodicity has played over the years a central role in the development of combinatorics on words and has been a highly valuable tool for the design and analysis of algorithms. There are many fundamental periodicity results on words. Among them is the famous result of Fine and Wilf which intuitively determines how far two periodic events have to match in order to guarantee a comm...
متن کاملPeriodicity properties on partial
The concept of periodicity has played over the years a centra1 role in the development of combinatorics on words and has been a highly valuable too1 for the design and analysis of algorithms. Fine and Wilf’s famous periodicity result, which is one of the most used and known results on words, has extensions to partia1 words, or sequences that may have a number of “do not know” symbols. These ext...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2004
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(04)90006-5